Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks

نویسندگان

  • Ida M. Pu
  • Daniel Stamate
  • Yuji Shen
چکیده

We propose a new strategy for reducing the amount of latency and energy consumption in Blocking Expanding Ring Search (BERS) and enhanced Blocking Expanding Ring Search (BERS*) for mobile ad hoc networks (MANETs). BERS and BERS* are respectively energy and energytime efficient route discovery protocols for MANETs as compared to conventional Expanding Ring Search (ERS). In this study, we identify unnecessary waiting time caused by a STOP/END instruction in BERS/BERS* and explore the potential of further improvement of their time efficiency. This leads to tBERS and tBERS*, the improved BERS and BERS* respectively. In tBERS/tBERS*, a route node may also issue the STOP/END instruction to terminate flooding. We implement this idea in algorithms, conduct analysis, and achieve further latency reduction in both tBERS and tBERS* as well as the energy saving in tBERS*.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blocking Expanding Ring Search Algorithm for Efficient Energy Consumption in Mobile Ad Hoc Networks

Efficient energy consumption is one of the important issues in Ad Hoc Networks. This paper identifies the inefficient elements during the route discovery in well known reactive protocols such as DSR and proposes the new Blocking-ERS approach, which demonstrates a substantial energy efficiency at small time expense in comparison to conventional Expanding Ring Search methods.

متن کامل

Improving Quality of Service Routing in Mobile Ad Hoc Networks Using OLSR

Mobile ad hoc networks (MANET) are constructed by mobile nodes without access point. Since MANET has certain constraints, including power shortages, an unstable wireless environment and node mobility, more power-efficient and reliable routing protocols are needed. The OLSR protocol is an optimization of the classical link state algorithm. OLSR introduces an interesting concept, the multipoint r...

متن کامل

Optimized and Reliable AODV for MANET

In recent years, mobile and wireless networks have witnessed a tremendous rise in technological advancement. Due to dynamic changing environment of MANET, it is desirable to design effective routing algorithms that can adapt its behavior to rapid and frequent changes in the network. In this paper, we propose an Optimized Reliable Ad hoc On-demand Distance Vector (ORAODV) scheme that offers quic...

متن کامل

Estimating Reliability in Mobile ad-hoc Networks Based on Monte Carlo Simulation (TECHNICAL NOTE)

Each system has its own definition of reliability. Reliability in mobile ad-hoc networks (MANET) could be interpreted as, the probability of reaching a message from a source node to destination, successfully. The variability and volatility of the MANET configuration makes typical reliability methods (e.g. reliability block diagram) inappropriate. It is because, no single structure or configurat...

متن کامل

Efficient Multicast Ad-hoc On-Demand Distance Vector Routing Protocol

Mobile Ad-hoc Network (MANET) is an autonomous, multi-hop and dynamic network composed of number of wireless mobile nodes. Routing protocols are challenges in designing Mobile Ad-hoc networks with low energy consuming and low control overhead. Ad-hoc on demand distance vector routing protocol (AODV) is specially designed for mobile ad-hoc networks with Expanding Ring Search (ERS) technique for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Discrete Algorithms

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2014